Secure image encryption scheme using 4D-Hyperchaotic systems based reconfigurable pseudo-random number generator and S-Box

This paper introduces the design of a hardware efficient reconfigurable pseudorandom number generator (PRNG) using two different feedback controllers based four-dimensional (4D) hyperchaotic systems i.e. Hyperchaotic-1 and -2 to provide confidentiality for digital images. The parameter's value of these two hyperchaotic systems is set to be a specific value to get the benefits i.e. all the multiplications (except a few multiplications) are performed using hardwired shifting operations rather than the binary multiplications, which doesn't utilize any hardware resource. The ordinary differential equations (ODEs) of these two systems have been exploited to build a generic architecture that fits in a single architecture. The proposed architecture provides an opportunity to switch between two different 4D hyperchaotic systems depending on the required behavior. To ensure the security strength, that can be also used in the encryption process in which encrypt the input data up to two times successively, each time using a different PRNG configuration. The proposed reconfigurable PRNG has been designed using Verilog HDL, synthesized on the Xilinx tool using the Virtex-5 (XC5VLX50T) and Zynq (XC7Z045) FPGA, its analysis has been done using Matlab tool. It has been found that the proposed architecture of PRNG has the best hardware performance and good statistical properties as it passes all fifteen NIST statistical benchmark tests while it can operate at 79.101-MHz or 1898.424-Mbps and utilize only 0.036 %, 0.23 %, and 1.77 % from the Zynq (XC7Z045) FPGA's slice registers, slice LUTs, and DSP blocks respectively. Utilizing these PRNGs, we design two 16 × 16 substitution boxes (S-boxes). The proposed S-boxes fulfill the following criteria: Bijective, Balanced, Non-linearity, Dynamic Distance, Strict Avalanche Criterion (SAC) and BIC non-linearity criterion. To demonstrate these PRNGs and S-boxes, a new three different scheme of image encryption algorithms have been developed: a) Encryption using S-box-1, b) Encryption using S-box-2 and, c) Two times encryption using S-box-1 and S-box-2. To demonstrate that the proposed cryptosystem is highly secure, we perform the security analysis (in terms of the correlation coefficient, key space, NPCR, UACI, information entropy and image encryption quantitatively in terms of (MSE, PSNR and SSIM)).     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

Non-chaotic and chaotic propagation of stationary and dynamic images through MVKS turbulence

Anisoplanatic electromagnetic (EM) propagation across a turbulent atmosphere has been recently examined for an unmodulated carrier propagating over an image-bearing transparency through optical lensing, and for the embedded information inside a carrier recovered using heterodyning and digital demodulation. Carrier modulation yielded better recovery than simple lens-based imaging. A possible mitigation strategy is proposed whereby the image information is encrypted on an RF chaotic carrier, thereafter secondarily embedded onto an optical carrier. Results based on the modified von Karman (MVKS) and the Hufnagel-Valley (H-V) models showed that the signal/image recovery under turbulence is improved compared with non-chaotic propagation. The case of time-varying/dynamic images is also taken up; it is demonstrated via cross-correlation products that turbulence is mitigated by the use of chaotic carrier encryption. Overall, transmission via chaos offers mitigation against distortions due to turbulence along with the security feature inherent via the chaos keys which prevent signal recovery without key-matching.     

An effective coding approach for multiobjective integrated resource selection and operation sequences problem

In this paper, we consider an integrated Resource Selection and Operation Sequences (iRS/OS) problem in Intelligent Manufacturing System (IMS). Several kinds of objectives are taken into account, in which the makespan for orders should be minimized; workloads among machine tools should be balanced; the total transition times between machines in a local plant should also be minimized. To solve this multiobjective iRS/OS model, a new two vectors-based coding approach has been proposed to improve the efficiency by designing a chromosome containing two kinds of information, i.e., operation sequences and machine selection. Using such kind of chromosome, we adapt multistage operation-based Genetic Algorithm (moGA) to find the Pareto optimal solutions. Moreover a special technique called left-shift hillclimber has been used as one kind of local search to improve the efficiency of our algorithm. Finally, the experimental results of several iRS/OS problems indicate that our proposed approach can obtain best solutions. Further more comparing with previous approaches, moGA performs better for finding Pareto solutions. Received: May 2005/Accepted: December 2005     

非线性扩频序列的三项式特性

讨论了三类非线性扩频序列(GMW序列、No序列和Kasami序列)的三项式特性，利用这三类序列的迹表示，证明了GMW序列、No序列和Kasami序列均具有正则三项式对。     

CHAOTIC HYDRODYNAMICS IN HORIZONTAL GAS-LIQUID BUBBLY FLOW

ＮＯＭＥＮＣＬＡＴＵＲＥｄ———ｅｍｂｅｄｄｉｎｇｄｉｍｅｎｓｉｏｎ ,ｄｉｍｅｎｓｉｏｎｌｅｓｓＣｄ(ｒ)———ｃｏｒｒｅｌａｔｉｏｎｓｕｍ ,ｄｉｍｅｎｓｉｏｎｌｅｓｓＮ———ｎｕｍｂｅｒｏｆｐａｉｒｓｏｆｐｏｉｎｔｓｏｎｔｈｅｒｅｃｏｎ ｓｔｒｕｃｔｅｄａｔｔｒａｃｔｏｒ,ｄｉｍｅｎｓｉｏｎｌｅｓｓｒ———ｓｃａｌｉｎｇｄｉｓｔａｎｃｅ ,ｄｉｍｅｎｓｉｏｎｌｅｓｓＤｃ ———ｃｏｒｒｅｌａｔｉｏｎｄｉｍｅｎｓｉｏｎ ,ｄｉｍｅｎｓｉｏｎｌｅｓｓＫ———Ｋｏｌｍｏｇｏｒｏｖｅｎｔｒｏｐｙ ,ｂｉｔｓ/ｓＲ…     

一种基于混沌渐近同步的数字保密通信方法

根据驱动－响应混沌同步原理，提出了一种基于混沌渐近同步的数字保密通信方法。通过设计对发射信号进行多级单值非线性变换，使得通过预测法的攻击完全失效，因而这种通信方法具有较高的抗破译能力。理论分析和数值模拟结果证实了本方法的正确性与有效性。     

两两NQD列乘积和的Jamison型强稳定性的一个注记

讨论了不同分布两两NQD列的Jamison型加权乘积和的强稳定性。推广了不同分布独立列部分和和同分布NQD列部分和情形相类似的结论，得到了一些新的结果。     

A Neural Network Approach for Signal Detection in Digital Communications

In this paper, we propose a new approach for signal detection in wireless digital communications based on the neural network with transient chaos and time-varying gain (NNTCTG), and give a concrete model of the signal detector after appropriate transformations and mappings. It is well known that the problem of the maximum likelihood signal detection can be described as a complex optimization problem that has so many local optima that conventional Hopfield-type neural networks fail to solve. By refraining from the serious local optima problem of Hopfield-type neural networks, the NNTCTG makes use of the time-varying parameters of the recurrent neural network to control the evolving behavior of the network so that the network undergoes the transition from chaotic behavior to gradient convergence. It has richer and more flexible dynamics rather than conventional neural networks only with point attractors, so that it can be expected to have much ability to search for globally optimal or near-optimal solutions. After going through a transiently inverse-bifurcation process, the NNTCTG can approach the global optimum or the neighborhood of global optimum of our problem. Simulation experiments have been performed to show the effectiveness and validation of the proposed neural network based method for the signal detection in digital communications.     

网络行为建模环境的实现及网络混沌性状分析

设计并实现了一种用于网络行为研究的网络行为建模环境，将网络环境的监测功能和网络行为的分析功能相互结合，为网络系统行为的研究奠定了基础。在这一环境下，归纳了四种有普遍意义的网络突发流量模型，并用混沌分形理论中的迭代函数系统和相空间重构方法对它们进行描述、分析、计算和重构，得到了它们的分形维以及能体现网络流量行为特性的宏观参数。